Deterministic Sampling for Propagating Model Covariance
نویسندگان
چکیده
منابع مشابه
Propagating Covariance in Computer Vision
This paper describes how to propagate approximately additive random perturbations through any kind of vision algorithm step in which the appropriate random perturbation model for the estimated quantity produced by the vision step is also an additive random perturbation. We assume that the vision algorithm step can be modeled as a calculation (linear or non-linear) that produces an estimate that...
متن کاملCovariance-Adaptive Slice Sampling
We describe two slice sampling methods for taking multivariate steps using the crumb framework. These methods use the gradients at rejected proposals to adapt to the local curvature of the log-density surface, a technique that can produce much better proposals when parameters are highly correlated. We evaluate our methods on four distributions and compare their performance to that of a non-adap...
متن کاملExtreme Compressive Sampling for Covariance Estimation
We consider the problem of estimating the covariance of a collection of vectors given extremely compressed measurements of each vector. We propose and study an estimator based on back-projections of these compressive samples. We show, via a distribution-free analysis, that by observing just a single compressive measurement of each vector one can consistently estimate the covariance matrix, in b...
متن کاملModel Predictive Path Integral Control using Covariance Variable Importance Sampling
In this paper we present a Model Predictive Path Integral (MPPI) control algorithm that is derived from the path integral control framework and a generalized importance sampling scheme. In order to operate in real time we parallelize the sampling based component of the algorithm and achieve massive speed-up by using a Graphical Processor Unit (GPU). We compare MPPI against traditional model pre...
متن کاملDeterministic algorithms for sampling count data
Processing and extracting meaningful knowledge from count data is an important problem in data mining. The volume of data is increasing dramatically as the data is generated by day-to-day activities such as market basket data, web clickstream data or network data. Most mining and analysis algorithms require multiple passes over the data, which requires extreme amounts of time. One solution to s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM/ASA Journal on Uncertainty Quantification
سال: 2013
ISSN: 2166-2525
DOI: 10.1137/120899133